Efficient Reverse Skyline Algorithm for Discovering Top K-dominant Products
نویسندگان
چکیده
Recent boom in internet growth and the advancement in internet security have led to rapid growth in Ecommerce and related services. In this context, capturing the preferences of customers plays an important role in decisions about the design and launch of new products in the market. The science that primarily deals with the support of such decisions is the Operational Research. Since many of the research problems of Operational Research have to do with the analysis of large volumes of data, therefore there has been a keen interest in data management methods to solve these problems. In this work we develop new algorithms for two problems related to the analysis of large volumes of consumer preferences, with practical applications in market research. The first problem we consider is to find the potential buyers of a product (potential customer’s identification). We formulated this problem as a reverse query skyline and propose a new algorithm called ERS. Secondly, Practical applications often require simultaneous processing of multiple queries. To resolve this problem, we formulated a new type of query, which is referred to as a query to find the k dominant candidates (k-dominant query). Our experimental evaluation validates the efficiency of the proposed algorithm which outperforms BRS by a huge margin.
منابع مشابه
Discovering Attractive Products based on Influence Sets
Skyline queries have been widely used as a practical tool for multi-criteria decision analysis and for applications involving preference queries. For example, in a typical online retail application, skyline queries can help customers select the most interesting, among a pool of available, products. Recently, reverse skyline queries have been proposed, highlighting the manufacturer’s perspective...
متن کاملDiscovering the Skyline of Web Databases
Many web databases are “hidden” behind proprietary search interfaces that enforce the top-k output constraint, i.e., each query returns at most k of all matching tuples, preferentially selected and returned according to a proprietary ranking function. In this paper, we initiate research into the novel problem of skyline discovery over top-k hidden web databases. Since skyline tuples provide cri...
متن کاملRanking uncertain sky: The probabilistic top-k skyline operator
Many recent applications involve processing and analyzing uncertain data. In this paper, we combine the feature of top-k objects with that of skyline to model the problem of top-k skyline objects against uncertain data. The problem of efficiently computing top-k skyline objects on large uncertain datasets is challenging in both computing the top-k skyline objects is developed for discrete cases...
متن کاملk-dominant and Extended k-dominant Skyline
Skyline queries have recently attracted a lot of attention for its intuitive query formulation. It can act as a filter to discard sub-optimal objects. However, a major drawback of skyline is that, in datasets with many dimensions, the number of skyline objects becomes large and no longer offer any interesting insights. To solve the problem, k-dominant skyline queries have been introduced, which...
متن کاملTop-k Skyline Groups Queries
The top-k skyline groups query (k-SGQ) returns k skyline groups that dominate the maximum number of points in a given data set. It combines the advantages of skyline groups and top-k queries. The k-SGQ is an important tool for queries that need to analyze not only individual points but also groups of points, and can be widely used in areas such as decision support applications, market analysis ...
متن کامل